Performance Bounds on Spatial Coverage Tasks by Stochastic Robotic Swarms
نویسندگان
چکیده
This paper presents a novel procedure for computing parameters of a robotic swarm that guarantee coverage performance by the swarm within a specified error from a target spatial distribution. The main contribution of this paper is the analysis of the dependence of this error on two key parameters: the number of robots in the swarm and the robot sensing radius. The robots cannot localize or communicate with one another, and they exhibit stochasticity in their motion and task-switching policies. We model the population dynamics of the swarm as an advection-diffusion-reaction partial differential equation (PDE) with time-dependent advection and reaction terms. We derive rigorous bounds on the discrepancies between the target distribution and the coverage achieved by individualbased and PDE models of the swarm. We use these bounds to select the swarm size that will achieve coverage performance within a given error and the corresponding robot sensing radius that will minimize this error. We also apply the optimal control approach from our prior work in [13] to compute the robots’ velocity field and task-switching rates. We validate our procedure through simulations of a scenario in which a robotic swarm must achieve a specified density of pollination activity over a crop field.
منابع مشابه
Design of Stochastic Robotic Swarms for Target Performance Metrics in Boundary Coverage Tasks
In this work, we analyze stochastic coverage schemes (SCS) for robotic swarms in which the robots randomly attach to a onedimensional boundary of interest using local communication and sensing, without relying on global position information or a map of the environment. Robotic swarms may be required to perform boundary coverage in a variety of applications, including environmental monitoring, c...
متن کاملComparing Coordination Schemes for Miniature Robotic Swarms: A Case Study in Boundary Coverage of Regular Structures
We consider boundary coverage of a regular structure by a swarm of miniature robots, and compare a suite of three fully distributed coordination algorithms experimentally. All algorithms rely on boundary coverage by reactive control, whereas coordination of the robots high-level behavior is fundamentally different: random, self-organized, and deliberative with reactive elements. The self-organi...
متن کاملLearning of Coordination Policies for Robotic Swarms
Inspired by biological swarms, robotic swarms are envisioned to solve real-world problems that are difficult for individual agents. Biological swarms can achieve collective intelligence based on local interactions and simple rules; however, designing effective distributed policies for large-scale robotic swarms to achieve a global objective can be challenging. Although it is often possible to d...
متن کاملUsing Haptic Feedback in Human Robotic Swarms Interaction
Robotic swarms display emergent behaviors that are robust to failure of individual robots, although they can not necessarily accomplish complex tasks with these behaviors. The research objective is to make use of their robust behaviors to accomplish complex tasks in many types of environments. For now, it is difficult to affect swarm “goals”, and therefore difficult them to direct to perform co...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کامل